A Geometric Algorithm for Finding the Largest Milling Cutter

A Geometric Algorithm for Finding the Largest Milling Cutter

In this paper, we describe a new geometric algorithm to determine the largest feasible cutter size for 2-D milling operations to be performed using a single cutter. In particular: 1. We give a general definition of the problem as the task of covering a target region without interfering with an obstruction region. This definition encompasses the task of milling a general 2-D profile that include...

A Geometric Algorithm for Finding the Maximal Cutter for 2-d Milling Operations

In this paper, we present a geometric algorithm of finding the maximal cutter for 2-D milling operations. Our algorithm works not only for the common closed pocket problem, but also for the general 2-D milling problems with open edges. We define the general 2-D milling process in terms of a “target region” to be machined and an “obstruction region” that should not intersect with the cutter duri...

Algorithm for finding the largest inscribed rectangle in polygon

In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...

Finding the Maximal Cutter for 2-d Milling Operations

NC machining is being used to create increasingly complex shapes. These complex shapes are used in a variety of defense, aerospace, and automotive applications to (1) provide performance improvements, and (2) create high performance tooling (e.g., molds for injection molding). The importance of the machining process is increasing due to latest advances in high speed machining that allows machin...

Study of the effective cutter radius for end milling of free-form surfaces using a torus milling cutter